An Experimental Survey on Single Linkage Clustering

Clusters are useful to identify required object from the huge amount of datasets. There are lots of clustering methods, used to create clusters. Single linkage clustering method is an example of hierarchical agglomerative clustering which is used to merge objects in a cluster, based on minimum distance. In this paper we performed an experiment on two dimensional spaces where multiple objects are available and combine in clusters by Euclidean distance. In this paper, MATLAB is used to calculate the distance between two objects and constructing distance matrix. After completing the whole single linage clustering method dendogram has been prepared. This dendogram is similar to minimum spanning tree because it is prepared using minimum distance of objects. These prepared clusters and dendogram are useful for finding different knowledge from the huge data. General Terms Clustering, Euclidean distance, Distance matrix